Approximation algorithms

Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

Approximation Algorithms

Many of the optimization problems we would like to solve are NP hard There are several ways of coping with this apparent hardness For most problems there are straightforward exhaustive search algorithms and one could try to speed up such an algorithm Techniques which can be used include divide and conquer or the re ned branch and bound which allows to eliminate part of the search tree by comput...

Approximation Algorithms

In the hitting set problem one is given m subsets of a nite set N and one has to nd an X N of minimum cardinality that \hits" (intersects) all of them. The problem is NP-hard. It is not known whether there exists a polynomial-time approximation algorithm for the hitting set problem with a nite performance ratio. Special cases of the hitting set problem are described for which nite performance r...